Isospectral graphs and the representation-theoretical spectrum
نویسندگان
چکیده
منابع مشابه
Isospectral Graphs and Isospectral Surfaces
In memory of Hubert Pesce In this paper, we investigate the following question: to what extent is there a converse to the Theorem of Sunada Su] in the context of graphs? Our experience in dealing with the question, \Can one hear the shape of a drum?" is that the many facets of this question turn out to be surprisingly delicate. The present instance is no exception. We will rst present a partial...
متن کاملThe isospectral fruits of representation theory: quantum graphs and drums
We present a method which enables one to construct isospectral objects, such as quantum graphs and drums. One aspect of the method is based on representation theory arguments which are shown and proved. The complementary part concerns techniques of assembly which are both stated generally and demonstrated. For that purpose, quantum graphs are grist to the mill. We develop the intuition that sta...
متن کاملGeneration of isospectral graphs
We discuss a discrete version of Sunada's Theorem on isospectral manifolds which allows to generate isospectral simple graphs, i.e. nonisomorphic simple graphs which have the same Laplace spectrum. We also consider additional boundary conditions and Buser's transplantation technique applied to a discrete situation.
متن کاملHomotopy equivalence of isospectral graphs
In previous work we defined a Quillen model structure, determined by cycles, on the category Gph of directed graphs. In this paper we give a complete description of the homotopy category of graphs associated to our model structure. We endow the categories of N-sets and Z-sets with related model structures, and show that their homotopy categories are Quillen equivalent to the homotopy category H...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2005
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.04.001